Image encryption based on chaotic tent map in time and frequency domains
Authors
Abstract:
The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase of the plain image. This change in the frequency domain causes changes in the pixels value and shuffles the pixels location in the time domain. Finally, in the time domain, a pseudo random image is produced using a chaotic tent map, to be combined to the image generated through the first step, and thus the final encrypted image is created. A computer simulation is also utilized to evaluate the proposed algorithm and to compare its results to images encrypted by other methods. The criteria for these comparisons are chi-square test of histogram, correlation coefficients of pixels, NPCR (number of pixel change rate), UACI (unified average changing intensity), MSE (mean square error) and MAE (mean absolute error), key space, and sensitivity to initial condition. These comparisons reveal that the proposed chaotic image encryption method shows a higher performance, and is of more secure.
similar resources
Cryptanalysis of Image Encryption Scheme Based on Chaotic Tent Map
With the development of chaos theory, many image encryption algorithmshave been designed using the properties associated withthechaotic map. The chaotic map shows high sensitivity to initial conditions and the sequence generated using chaotic map are unpredictable making it a good choice for performing encryption operation. But, without proper encryption algorithm design, encryption scheme desi...
full textComments on an image encryption scheme based on a chaotic Tent map
Recently an image encryption scheme based on a chaotic Tent map has been proposed by Li et al. [1]. This comment shows that this scheme is broken and no secure application can be found for it. The recent paper by Li et al. [1] proposed a chaotic image encryption based on a Tent map and evaluated its security through statistical analyses. It is true that when an image encryption scheme is design...
full textAn Image Encryption Approach Using Chaotic Map in Frequency Domain
This paper presents a chaotic map based cryptography technique, in the proposed technique; confusion and diffusion applied on spectral domain (on DCT(Discrete Cosine Transform) coefficients) hence the encryption can be achieved quickly without applying the large number of confusion and diffusion cycle as it is needed in spatial domain. Also the diffusion template is created by random number gen...
full textAn Image Encryption Scheme Based on 2D Tent Map and Coupled Map Lattice
This paper proposes a chaos-based image encryption scheme where one 2D tent map with two control parameters is utilized to generate chaotic orbits applied to scramble the pixel positions while one coupled map lattice is employed to yield random gray value sequences to change the gray values so as to enhance the security. Experimental results are carried out with detailed analysis to demonstrate...
full textEnhanced chaotic image encryption algorithm based on Baker's map
Imaging has gained importance due to the improvements of performances in computer speed, media storage and network bandwidth. Along with this advancement, the fundamental issue of image security has become a major concern and because of this reason, research in image confidentiality has gained popularity amongst security experts. This paper discusses an alternative chaotic image encryption base...
full textA Fast Image Encryption Scheme based on Chaotic Standard Map
In recent years, a variety of effective chaos-based image encryption schemes have been proposed. The typical structure of these schemes has the permutation and the diffusion stages performed alternatively. The confusion and diffusion effect is solely contributed by the permutation and the diffusion stage, respectively. As a result, more overall rounds than necessary are required to achieve a ce...
full textMy Resources
Journal title
volume 5 issue 1
pages 97- 110
publication date 2013-01-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023